An integer linear programming model of a school timetabling problem

An Integer Programming Model for the School Timetabling Problem

This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...

Integer programming for the generalized high school timetabling problem

Recently the XHSTT format for (High) School Timetabling was introduced, which provides a uniform way of modeling problem instances and corresponding solutions. The format supports a big variety of constraints, and currently 38 real-life instances from 11 di erent countries are available. Thereby the XHSTT format serves as a common ground for researchers within this area. This paper describes th...

Combining Metaheuristics and Integer Programming on School Timetabling problems

Fischetti and Lodi (2003) proposed the use of general MIP solvers to explore large neighborhoods around reference solutions. In the original article, this appeared as a branching strategy aimed at improving the practical behavior of exact methods, producing better solutions earlier. As predicted in this work, the potential of similar techniques in a heuristic context was worthy of further inves...

Hybridizing Integer Programming and Metaheuristics for Solving High School Timetabling

New integer linear programming approaches for course timetabling

The most complete form of academic timetabling problem is the population and course timetabling problem. In this problem, there may be multiple classes of each subject, and the decision on which students are to constitute each class is made in concert with the decision on the timetable for each class. In order to solve this problem, it is normally simplified or decomposed in some fashion. One s...